On Lexicographic Enumeration of Regular and Context-Free Languages
نویسنده
چکیده
We show that it is possible to e ciently enumerate the words of a regular language in lexicographic order. The time needed for generating the next word is O(n) when enumerating words of length n. We also de ne a class of context-free languages for which e cient enumeration is possible.
منابع مشابه
T F L T C E F L
We survey recent results on the enumeration of formal languages. In particular, we consider enumeration of regular languages accepted by deterministic and nondeterministic finite automata with n states, regular languages generated by regular expressions of a fixed length, and ω-regular languages accepted by Müller automata. We also survey the uncomputability of enumeration of context-free langu...
متن کاملOn the widths of regular and context free languages, with an application to information flow
Given a partially-ordered finite alphabet Σ and a language L ⊆ Σ∗, how large can an antichain in L be (where L is ordered by the lexicographic ordering)? This fundamental property of partial orders is known as the width and its computation is the central extremal problem for partially ordered sets. More precisely, since L will in general be infinite, we should ask about the rate of growth of ma...
متن کاملEnumerating Regular Expressions and Their Languages
In this chapter we discuss the problem of enumerating distinct regular expressions bysize and the regular languages they represent. We discuss various notions of the size of a regularexpression that appear in the literature and their advantages and disadvantages. We consider aformal definition of regular expressions using a context-free grammar.We then show how to enumerate stri...
متن کاملOverview of some general results in combinatorial enumeration
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and hypergraphs, relational structures, and others. The second part advertises five topics in general enumeration: 1. counting lattice points in lattice polytopes, 2...
متن کاملInductive Inference of Context-free Languages - Context-free Expression Method
An inductive inference problem of context-free languages is investigated. There have been many attempts to this problem, and most of them are based on a problem setting in which a representation space for hypotheses is a class of context-free grammars. An inference algorithm given in this paper , on the contrary, employs a kind of extensions of regular expressions called context-free expression...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 13 شماره
صفحات -
تاریخ انتشار 1997